Performance modeling of e-procurement workflow using Generalised Stochastic Petri net (GSPN)

This paper proposes a Generalised Stochastic Petri net (GSPN) model representing a generic e-procurement workflow process. The model displays the dynamic behaviour of the system and shows the inter relationship of process activities. An analysis based on matrix equation approach enabled users to analyse the critical system's states, and thus justify the process performance. The results obtained allow users for better decision making in improving e-procurement workflow performance

A linear algebraic approach in analyzing the M/GE/1 and GE/M/1 queuing systems at equilibrium

Uses the algebraic approach in the queuing theory to derive the M/G/1 equilibrium solution for the number of jobs in the system when the probability distribution function representing the general distribution is the generalized exponential (GE-type). Similarly the GE/M/1 system is solved. Furthermore, it has been shown that as expected the solutions are equivalent to the maximum entropy solutions of the M/G/1 and G/M/1 systems respectively at equilibrium

An interactive multimedia music repository over the internet

The aim of the Interactive Multimedia Music Repository project is to create a Malaysian music web site, into which any Internet user may surf to discover the kinds of music found in the country. The repository serves as a source of Malaysian musical reference and provides formal distance learning courses conducted on the same subject through the Internet. The multimedia information content implicit in such an application needs to be properly designed, implemented and managed for remote multimedia database access. The paper presents the criteria designed to guide the construction of the music repository database

A simulation study of data discovery mechanism for scientific data grid environment

Research in the area of grid computing has given us various ideas and solutions to address the requirements in a modern scientific computing community that managed massive amounts of a very large data collections in a geographically distributed environment. Data Grids mostly deal with large computational problems and provide geographically distributed resources for large-scale data-intensive applications that generate large data sets. A number of research groups are working on the data distribution problems in Data Grids and they are investigating the data replication approaches on the data distribution. This leads to a new problem in discovery and access to data in Data Grid environment. To address this problem we have developed a model to study various discovery mechanisms and investigate these mechanisms for Dynamic Scientific Data Grid Environments using our Grid Simulator. In this paper, we illustrate our model and our Grid Simulator

Decentralized replication strategies for P2P based scientific data grid

Scientific Data Grid provides geographically distributed resources for large-scale data-intensive applications that generate large scientific data sets and it mostly deals with large computational problems. Research in the area of grid has given various ideas and solutions to address these requirements. However, since the number of participants (scientists and institutes) that involve in this kind of environment is increasing tremendously, scalability, availability and reliability have been the core problem for such system. Peer-to-peer (P2P) is one of the architecture that promising scale and dynamism environment. In this paper, we present a P2P model for Scientific Data Grid that utilizes the P2P services to address those problems. For the purpose of this study, we have developed and used our own data grid simulation written using PARSEC. In this paper, we illustrate our P2P Scientific Data Grid model, our data grid simulation and the design of proposed data replication strategies. We then analyze the performance of data discovery service with and without the existence of replication strategies relative to their success rates, response time, average number of hop and bandwidth consumption. The results from simulation study that show how the proposed replication strategies promote high data availability in the proposed Scientific Data Grid model and how these strategies improve the discovery process are presented

Issues in implementing a scientific data grid based on peer-to-peer architecture

Grid and peer-to-peer (P2P) networks enable the sharing and aggregation of geographically distributed resources. Grids mostly deal with large computational problems and provide geographically distributed resources for large-scale data-intensive applications that generate large data sets, whereas P2P provides a way for sharing huge volumes of data. In a modern scientific computing, the communities of researchers involves in organizing, moving, visualizing, and analyzing massive amounts of a very large data collections in a geographically distributed environment. Research in the area of grid and P2P computing; have given us various ideas and solutions to address the problems. One of the most challenging issues in grid computing that address above requirements is locating and sharing remote data. In this paper, we illustrate the idea of using P2P approach for locating and sharing data in scientific data grid environment through our P2P scientific data grid framework

A framework for multi-backpropagation

Backpropagation algorithm is one of the most popular learning algorithms in the Neural Network. It has been successfully implemented in many applications. However, training Neural Networks involve a large amount of data. Therefore, training the network is time consuming as each training session requires several epochs, which usually takes smeral seconds or even minutes.This paper proposes a multi-backpropagation approach to minimize the complexity of the network. The approach does not require an alteration of the algorithm. Instead, the large network is split into several smaller networks. An integrating network is then constructed to integrate the output from the smaller networks

Data discovery algorithm for scientific data grid environment

In modern scientific computing communities, scientists are involved in managing massive amounts of very large data collections in a geographically distributed environment. Research in the area of grid computing has given us various ideas and solutions to address these requirements. Data grid mostly deals with large computational problems and provides geographically distributed resources for large-scale data-intensive applications that generate large data sets. Peer-to-peer (P2P) networks have also become a major research topic over the last few years. In a distributed P2P system, a discovery algorithm is required to locate specific information, applications, or users within the system. In this research work, we present our scientific data grid as a large P2P-based distributed system model. By using this model, we study various discovery algorithms for locating data sets in a data grid system. The algorithms we studied are based on the P2P architecture. We investigate these algorithms using our Grid Simulator developed using PARSEC. In this paper, we illustrate our scientific data grid model and our Grid Simulator. We then analyze the performance of the discovery algorithms relative to their average number of hop, success rates and bandwidth consumption. © 2005 Elsevier Inc. All rights reserved

Transformation framework for legacy software migration

A legacy system is a system that is built using old technologies, but it is still beneficial to an organization. However, today it is facing a great challenge to meet the demands of current applications. Organizations are coming under great pressure to decide on the fate of the legacy system as they try to cope with the changing scenario. Among the alternatives offered are: discarding the legacy system and replacing it with a totally new system, allowing the system to deteriorate until the organization is out of business, redeveloping the system, or reengineering the system. Reengineering seems to offer the best solution to the challenge. This paper focuses on transformation, which is one of the reengneering technologies for migrating a legacy system toward an evolvable system. A few legacy software transformation approaches are discussed. A framework for legacy software migration that combines the strengths of each of the described approaches is proposed

A web architecture for an information system for Malaysian music

The design and development of a comprehensive web resource on Malaysian music involves the archiving of information from published and unpublished sources, based on a previously developed classification scheme. The data to be presented includes text data, audio samples, music sequences, still images, video data, and animated graphics. The web site architecture comprises two layers - the visible layer, determined by the subject architecture; and the underlying layer, or the application architecture, which is dependant to a certain extent on the visible layer, but does not mirror its structure completely. The development procedure starts with the data preparation, including the organization of the information content to be published, and the selection of specific data formats to be used. Software design issues include: objectives, system components, the subject architecture, and the application architecture. Coding and testing are also carried out. Site performance and access results indicate that the proposed web architecture is suitable for the delivery of information on Malaysian music over the World Wide Web (WWW)